Is quantum computing for real?

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing optimal subsidies for Iranian renewable energy investments using real options

For the valuation of the renewable energy investments, providing private investors with a financial incentive to accelerate their investment is a very significant issue. Financial subsidies are known by the majority of the people to be one of the most important drivers in renewable energy expansion and one of the main reasons which result in the development of any industry. In this paper, we pr...

متن کامل

Computing quantum discord is NP-complete

We study the computational complexity of quantum discord (a measure of quantum correlation beyond entanglement), and prove that computing quantum discord is NP-complete. Therefore, quantum discord is computationally intractable: the running time of any algorithm for computing quantum discord is believed to grow exponentially with the dimension of the Hilbert space so that computing quantum disc...

متن کامل

Types for quantum computing

This thesis is a study of the construction and representation of typed models of quantum mechanics for use in quantum computation. We introduce logical and graphical syntax for quantum mechanical processes and prove that these formal systems provide sound and complete representations of abstract quantum mechanics. In addition, we demonstrate how these representations may be used to reason about...

متن کامل

Quantum computing for beginners

The paper introduces the basic concepts and principles behind quantum computing and examines in detail Shor’s quantum algorithm for factoring very large numbers. Some basic methodological principles and guidelines for constructing quantum algorithms are stated. The aim is not to provide a formal exposition of quantum computing but to identify its novelty and potential use in tackling NP-hard pr...

متن کامل

Finding resource states of measurement-based quantum computing is harder than quantum computing

Measurement-based quantum computing enables universal quantum computing with only adaptive single-qubit measurements on certain many-qubit states, such as the graph state, the AffleckKennedy-Lieb-Tasaki (AKLT) state, and several tensor-network states. Finding new resource states of measurement-based quantum computing is a hard task, since for a given state there are exponentially many possible ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Ubiquity

سال: 2017

ISSN: 1530-2180

DOI: 10.1145/3084688